https://nova.newcastle.edu.au/vital/access/ /manager/Index en-au 5 https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:21607 a, d)-edge-antimagic total labeling of a graph G with p vertices and q edges is a bijection f from the set of all vertices and edges to the set of positive integers {1, 2, 3, . . . , p + q} such that all the edge-weights w(uv) = f(u) + f(v) + f(uv); uv ∈ E(G), form an arithmetic progression starting from a and having common difference d. An (a, d)-edge-antimagic total labeling is called a super (a, d)-edge-antimagic total labeling ((a, d)-SEAMT labeling) if f(V (G)) = {1, 2, 3, . . . , p}. In this paper we investigate the existence of super (a, d)-edge antimagic total labeling for friendship graphs and generalized friendship graphs.]]> Sat 24 Mar 2018 07:59:31 AEDT ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:29690 (a,d)-edge antimagic total labeling of a (p, q)-graph G is bijection f:V∪E→{1,2,3,…,p+q} with the property that the edge-weights w(uv)=f(u)+f(v)+f(uv) where uv∈E(G) form an arithmetic progression a,a+d,…,a+(q−1)d, where a > 0 and d ≥ 0 are two fixed integers. If such a labeling exists, then G is called an (a,d)-edge antimagic total graph. If further the vertex labels are the integers {1,2,3,…,p}, then f is called a super (a,d)-edge antimagic total labeling of G ((a, d)-SEAMT labeling) and a graph which admits such a labeling is called a super (a,d)-edge antimagic total graph ((a, d)-SEAMT graph). If d=0, then the graph G is called a super edge-magic graph. In this paper we investigate the existence of super (a, 3)-edge antimagic total labelings for union of two stars.]]> Sat 24 Mar 2018 07:38:47 AEDT ]]>